Structural Properties of Complete Problems for Exponential Time 1
نویسنده
چکیده
The properties and structure of complete sets for exponential-time classes are surveyed. Strong reductions, those implying many-one completeness, are considered as strengthenings of the usual completeness notions. From the results on strong reductions, immunity properties of complete sets are derived. Diierences are shown between complete sets arising from the various polynomial-time reductions. These include most of the \weak" reduction between p m and p T. Finally we consider complete sets for some other classes such as r.e. sets along with structural properties of these sets.
منابع مشابه
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisfiability threshold has centered around the structure and connectivity of the solution space. Motivated by this work, we study structural and connectivity-related properties of the space of solutions of Boolean satisfi...
متن کاملExact Algorithms and Complexity
Over the past couple of decades, a series of exact exponential-time algorithms have been developed with improved run times for a number of problems including IndependentSet, k-SAT, and k-colorability using a variety of algorithmic techniques such as backtracking, dynamic programming, and inclusion-exclusion. The series of improvements are typically in the form of better exponents compared to ex...
متن کاملA new adaptive exponential smoothing method for non-stationary time series with level shifts
Simple exponential smoothing (SES) methods are the most commonly used methods in forecasting and time series analysis. However, they are generally insensitive to non-stationary structural events such as level shifts, ramp shifts, and spikes or impulses. Similar to that of outliers in stationary time series, these non-stationary events will lead to increased level of errors in the forecasting pr...
متن کاملA Study of Exponential Neighborhoods for theTravelling Salesman Problem and for theQuadratic Assignment
This paper deals with so-called exponential neighborhoods for combinatorial optimization problems, i.e. with large sets of feasible solutions whose size grows exponentially with the input length. We are especially interested in exponential neighborhoods over which the TSP (respectively, the QAP) can be solved in polynomial time, and we investigate combinatorial and algorithmical questions relat...
متن کاملTime-Discontinuous Finite Element Analysis of Two-Dimensional Elastodynamic Problems using Complex Fourier Shape Functions
This paper reformulates a time-discontinuous finite element method (TD-FEM) based on a new class of shape functions, called complex Fourier hereafter, for solving two-dimensional elastodynamic problems. These shape functions, which are derived from their corresponding radial basis functions, have some advantages such as the satisfaction of exponential and trigonometric function fields in comple...
متن کامل